| 翻訳と辞書 |
| Leonidas John Guibas ： ウィキペディア英語版 |
Leonidas J. Guibas
Leonidas John Guibas ((ギリシア語:Λεωνίδας Γκίμπας)) is a professor of computer science at Stanford University, where he heads the geometric computation group and is a member of the computer graphics and artificial intelligence laboratories. Guibas was a student of Donald Knuth at Stanford, where he received his Ph.D. in 1976.〔.〕 He has worked for several industrial research laboratories, and joined the Stanford faculty in 1984. He was program chair for the ACM Symposium on Computational Geometry in 1996,〔(Program Committees from the Symposium on Computational Geometry ), Computational Geometry Steering Committee.〕 is a Fellow of the ACM〔(ACM Fellow award citation ).〕 and the IEEE,〔(2012 Newly Elevated Fellows ), IEEE, accessed 2011-12-10.〕 and was awarded the ACM - AAAI Allen Newell Award for 2007 “for his pioneering contributions in applying algorithms to a wide range of computer science disciplines.“〔(ACM/AAAI Allen Newell Award Recognizes Leonidas Guibas for Algorithms Advancing CS Fields ), ACM, 2008; .〕 He has Erdős number 2 due to his collaborations with Boris Aronov, Andrew Odlyzko, János Pach, Richard M. Pollack, Endre Szemerédi, and Frances Yao.〔(Erdos number project ).〕 The research contributions he is known for include finger trees, red-black trees, fractional cascading, the Guibas–Stolfi algorithm for Delaunay triangulation, an optimal data structure for point location, the quad-edge data structure for representing planar subdivisions, Metropolis light transport, and kinetic data structures for keeping track of objects in motion.
==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Leonidas J. Guibas」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|